linear recurrence

См. также в других словарях:

• Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… …   Wikipedia

• Recurrence period density entropy — (RPDE) is a method, in the fields of dynamical systems, stochastic processes, and time series analysis, for determining the periodicity, or repetitiveness of a signal. Overview Recurrence period density entropy is useful for characterising the… …   Wikipedia

• Recurrence quantification analysis — (RQA) is a method of nonlinear data analysis (cf. chaos theory) for the investigation of dynamical systems. It quantifies the number and duration of recurrences of a dynamical system presented by its phase space trajectory.BackgroundThe… …   Wikipedia

• Recurrence plot — In descriptive statistics and chaos theory, a recurrence plot (RP) is a plot showing, for a given moment in time, the times at which a phase space trajectory visits roughly the same area in the phase space. In other words, it is a graph of… …   Wikipedia

• Linear congruential generator — A linear congruential generator (LCG) represent one of the oldest and best known pseudorandom number generator algorithms. [ [http://demonstrations.wolfram.com/LinearCongruentialGenerators/ Linear Congruential Generators] by Joe Bolte, The… …   Wikipedia

• linear measure — measure meas ure (m[e^]zh [ u]r; 135), n. [OE. mesure, F. mesure, L. mensura, fr. metiri, mensus, to measure; akin to metrum poetical measure, Gr. me tron, E. meter. Cf. {Immense}, {Mensuration}, {Mete} to measure.] 1. A standard of dimension; a… …   The Collaborative International Dictionary of English

• Cross-recurrence quantification — (CRQ) is a non linear method that quantifies how similarly two observed data series unfold over time.[1] CRQ produces measures reflecting coordination, such as how often two data series have similar values or reflect similar system states (called …   Wikipedia

• Fibonacci number — A tiling with squares whose sides are successive Fibonacci numbers in length …   Wikipedia

• Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal …   Wikipedia

• Mersenne twister — The Mersenne twister is a pseudorandom number generator developed in 1997 by Makoto Matsumoto (松本 眞?) and Takuji Nishimura (西村 拓士?)[1] …   Wikipedia

• Clenshaw algorithm — In numerical analysis, the Clenshaw algorithm[1] is a recursive method to evaluate a linear combination of Chebyshev polynomials. In general it applies to any class of functions that can be defined by a three term recurrence relation.[2] Contents …   Wikipedia